GRAPHIC AND REPRESENTABLE FUZZIFYING MATROIDS
نویسندگان
چکیده
منابع مشابه
CATEGORICAL RELATIONS AMONG MATROIDS, FUZZY MATROIDS AND FUZZIFYING MATROIDS
The aim of this paper is to study the categorical relations betweenmatroids, Goetschel-Voxman’s fuzzy matroids and Shi’s fuzzifying matroids.It is shown that the category of fuzzifying matroids is isomorphic to that ofclosed fuzzy matroids and the latter is concretely coreflective in the categoryof fuzzy matroids. The category of matroids can be embedded in that offuzzifying matroids as a simul...
متن کاملCategorical Relations among Matroids, Fuzzy Matroids and Fuzzifying Matroids
The aim of this paper is to study the categorical relations between matroids, Goetschel-Voxman’s fuzzy matroids and Shi’s fuzzifying matroids. It is shown that the category of fuzzifying matroids is isomorphic to that of closed fuzzy matroids and the latter is concretely coreflective in the category of fuzzy matroids. The category of matroids can be embedded in that of fuzzifying matroids as a ...
متن کاملBASES AND CIRCUITS OF FUZZIFYING MATROIDS
In this paper, as an application of fuzzy matroids, the fuzzifying greedy algorithm is proposed and an achievableexample is given. Basis axioms and circuit axioms of fuzzifying matroids, which are the semantic extension for thebasis axioms and circuit axioms of crisp matroids respectively, are presented. It is proved that a fuzzifying matroidis equivalent to a mapping which satisfies the basis ...
متن کاملOn pancyclic representable matroids
Bondy proved that an n-vertex simple Hamiltonian graph with at least n2/4 edges has cycles of every length unless it is isomorphic to Kn/2,n/2. This paper considers finding circuits of every size in GF (q)-representable matroids with large numbers of elements. A consequence of the main result is that a rank-r simple binary matroid with at least 2r−1 elements has circuits of all sizes or is isom...
متن کاملGraphic Matroids
Matroid theory was first formalized in 1935 by Whitney [5] who introduced the notion as an attempt to study the properties of vector spaces in an abstract manner. Since then, matroids have proven to have numerous applications in a wide variety of fields including combinatorics and graph theory. Today we will briefly survey matroid representation and then discuss some problems in matroid optimiz...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proyecciones (Antofagasta)
سال: 2010
ISSN: 0716-0917
DOI: 10.4067/s0716-09172010000100003